Free Indexation: Combinatorial Analysis and a Compositional Algorithm
نویسنده
چکیده
The principle known as 'free indexation' plays an important role in the determination of the refer-ential properties of noun phrases in the principle-and-parameters language framework. First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. Secondly, we exhibit a provably optimal free indexation algorithm .
منابع مشابه
THIN WALLED STEEL SECTIONS’ FREE SHAPE OPTIMIZATION USING CHARGED SYSTEM SEARCH ALGORITHM
Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...
متن کاملDiagnosis of Breast Cancer using a Combination of Genetic Algorithm and Artificial Neural Network in Medical Infrared Thermal Imaging
Introduction This study is an effort to diagnose breast cancer by processing the quantitative and qualitative information obtained from medical infrared imaging. The medical infrared imaging is free from any harmful radiation and it is one of the best advantages of the proposed method. By analyzing this information, the best diagnostic parameters among the available parameters are selected and ...
متن کاملOptimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کامل